{ Google Code Jam 2011. Round 1A.
  Problemset: http://code.google.com/codejam/contest/dashboard?c=1145485
  Problem A.
  Verdict: Correct/Incorrect
}
uses SysUtils, Math;

var 
	a,b,c,g:int64;
	t,i,j,k:longint;
	f:boolean;
	
begin
reset(input,'input.txt');
rewrite(output,'output.txt');
read(t);
for i:=1 to t do begin
	read(a,b,c);
	f:=false;
	k:=-1;
	for j:=1 to a do begin
		if trunc(b/100*j)=b/100*j then begin
			k:=trunc(b/100*j);
			f:=true;
			break;
		end;
	end;
	g:=c*10000;
	if (g<k) or (c*100<k) or (c*100<a) or ((c=0) and (b>0)) or ((c=100) and (b<100)) then f:=false;
	if ((b=0) and (c=0)) or ((b=100) and (c=100)) then f:=true;
	if not f then writeln('Case #',i,': Broken') else writeln('Case #',i,': Possible');	
end;
end.